An Update-Risk Based Approach to TTL Estimation in Web Caching
نویسندگان
چکیده
Web caching is an important technique for accelerating web applications and reducing the load on the web server and the network through local cache accesses. As in the traditional data caching, web caching poses the wellrecognized problem of maintaining cache consistency. Web caching, however, has the leeway of delaying the refreshment of caches when the web server updates the original data, i.e., web caching tries to get better performance allowing tolerable inconsistency. This weak consistency requirement introduced the concept of time-to-live (TTL: the time during which the cached data item is expected to be valid) in the face of future updates. Subsequently, a number of methods have been invented to have the cache server estimate the TTL. However, the two well-known TTL estimation methods—the fixed TTL method and the heuristic method— do not allow intuitive understanding of the estimation processes and lack theoretical reasoning behind them, disallowing administrators from configuring the cache server by their intention. To mend these deficiencies, we propose the update-risk based TTL estimation method. This method uses a formal, yet intuitive, approach based on probabilistic analysis. In the proposed method, users provide the update risk as the probability that the original data will be updated within the estimated TTL. Then, based on our model, the cache server calculates the value of the TTL using the update risk. The results of our experiments, performed using This work was supported by the Korea Science and Engineering Foundation (KOSEF) through the Advanced Information Technology Research Center (AITrc). the logs of a real cache server, show experimentally that the measured update risk closely matches the one used to estimate the TTL. Moreover, the notion of the update risk is clear in its intention and semantics. These confirm the superiority of our method to the conventional ones. We also show the impact of update risk on performance and consistency in order to help administrators select an appropriate value for update risk to obtain performance and consistency desired. In addition, we reilluminate the two aforementioned conventional methods in light of our method.
منابع مشابه
Modeling and analysis of an expiration-based hierarchical caching system
Caching is an important means to scale up the growth of the Internet. Weak consistency is a major approach used in Web caching and has been deployed in various forms. This paper investigates some properties and performance issues of an expiration-based caching system. We focus on a hierarchical caching system based on the Time-To-Live (TTL) expiration mechanism and present a basic model for suc...
متن کاملExact analysis of TTL cache networks
TTL caching models have recently regained significant research interest due to their connection to popular caching policies such as LRU. This paper advances the state-of-the-art analysis of TTL-based cache networks by developing two exact methods with orthogonal generality and computational complexity. The first method generalizes existing results for line networks under renewal requests to the...
متن کاملModeling and Anallysis of An Expiration-Based Hierarchical Caching System
AbsmcrCaching is an important mto wale up the invalidation [5]) is that they often involve higher overhead and growth of the lotemet. Weak consistency is a mdor approach complexity and are expensive to deploy. Nevertheless, strong used in caching and has in forms. consistency is an indispensable approach to deliver mission This paper investigates some properties and performance issues of an api...
متن کاملLifetime Behavior and its Impact on Web Caching
The exponential growth of the World Wide Web has made it the most popular information dissemination tool in the world. The growth necessitates caching, prefetching, and replication schemes on the web to alleviate the web server load, conserve the network band-width, and reduce the retrieval latency. At the same time, cache consistency should be maintained to avoid returning stale pages to users...
متن کاملOn randomized request redirection in hierarchical caching systems
Adopting Time-to-Live (TTL) based hierarchical caching systems is considered to be a viable approach to support Web content delivery under the weak consistency paradigm. However, with a strictly hierarchical structure in these systems, a single user request may trigger multiple consecutive miss events at cache servers of different levels. This undesirable miss synchronization can cause a sudden...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002